Mapping Data-Parallel Tasks Onto Partially Reconfigurable Hybrid Processor Architectures
نویسندگان
چکیده
منابع مشابه
Mapping Loops onto Reconfigurable Architectures
Recon gurable circuits and systems have evolved from application speci c accelerators to a general purpose computing paradigm. But the algorithmic techniques and software tools are also heavily based on the hardware paradigm from which they have evolved. Loop statements in traditional programs consist of regular, repetitive computations which are the most likely candidates for performance enhan...
متن کاملMapping Waveforms to Mobile Parallel Processor Architectures
Portable software defined radio solutions for the consumer market will be based on mobile devices employing multiple programmable processing resources, as low power consumption needs to be maintained for an acceptable battery life. Therefore the designer needs to orchestrate the given system functions of the waveform efficiently onto the dis tributed processing resources. For the automation or ...
متن کاملHardware Object Selection for Mapping Loops onto Reconfigurable Architectures
Reconngurable circuits and systems have evolved from application speciic accelerators to a general purpose computing paradigm. Re-connguring the logic is still an expensive operation and precludes frequent connguration changes. To reduce the overheads involved in reconnguration, devices with connguration caches and multiple contexts are being designed. Reconngurable computing solutions are typi...
متن کاملAnalysis of Inner-Loop Mapping onto Coarse-Grained Reconfigurable Architectures Using Hybrid Particle Swarm Optimization
Coarse-Grained Reconfigurable Architectures (CGRAs) have gained currency in recent years due to their abundant parallelism and flexibility. To utilize the parallelism found in CGRAs, this paper proposes a fast and efficient Modulo-Constrained Hybrid Particle Swarm Optimization (MCHPSO) scheduling algorithm to exploit loop-level parallelism in applications. This paper shows that Particle Swarm O...
متن کاملMinimizing network contention for mapping tasks onto massively parallel computers
This paper presents a new framework aimed at compile{time determination of satisfactory sub-optimal solutions to the mapping problem onto modern massively parallel computing systems. The approach incorporates realistic assumptions on the models both for parallel programs and target architectures. It is reened for the k-ary n-cube family of processor networks that use a deterministic routing alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Very Large Scale Integration (VLSI) Systems
سال: 2006
ISSN: 1063-8210,1557-9999
DOI: 10.1109/tvlsi.2006.884052